Solving 0-1 knapsack problems based on amoeboid organism algorithm
نویسندگان
چکیده
The 0-1 knapsack problem is an open issue in discrete optimization problems, which plays an important role in real applications. In this paper, a new bio-inspired model is proposed to solve this problem. The proposed method has three main steps. First, the 0-1 knapsack problem is converted into a directed graph by the network converting algorithm. Then, for the purpose of using the amoeboid organism model, the longest path problem is transformed into the shortest path problem. Finally, the shortest path problem can be well handled by the amoeboid organism algorithm. Numerical examples are given to illustrate the efficiency of the proposed model. 2013 Elsevier Inc. All rights reserved.
منابع مشابه
Genetic Algorithm with Directional Mutation Based on Greedy Strategy for Large-scale 0-1 Knapsack Problems
In view of the lack of efficiency or accuracy of solving large-scale 0-1 knapsack problems by the classic genetic algorithm, a directional mutation operator is designed to reduce the probability of resampling in the search process. Meanwhile an initializing operator and an individual correction operator are added to the algorithm to modify individual after every amendment, both of which are com...
متن کاملSolving the 0/1 Knapsack Problem by a Biomolecular DNA Computer
Solving some mathematical problems such as NP-complete problems by conventional silicon-based computers is problematic and takes so long time. DNA computing is an alternative method of computing which uses DNA molecules for computing purposes. DNA computers have massive degrees of parallel processing capability. The massive parallel processing characteristic of DNA computers is of particular in...
متن کاملMOEA/D with Uniform Design for Solving Multiobjective Knapsack Problems
The 0/1 knapsack problem is a well-known problem, which appears in many real domains with practical importance. The problem is NP-complete. The multiobjective 0/1 knapsack problem is a generalization of the 0/1 knapsack problem in which multiple knapsacks are considered. Many algorithms have been proposed in the past five decades for both single and multiobjective knapsack problems. A new versi...
متن کاملA Novel Harmony Search Algorithm Based on Teaching-Learning Strategies for 0-1 Knapsack Problems
To enhance the performance of harmony search (HS) algorithm on solving the discrete optimization problems, this paper proposes a novel harmony search algorithm based on teaching-learning (HSTL) strategies to solve 0-1 knapsack problems. In the HSTL algorithm, firstly, a method is presented to adjust dimension dynamically for selected harmony vector in optimization procedure. In addition, four s...
متن کاملCore problems in bi-criteria {0, 1}-knapsack problems
The most efficient algorithms for solving the single-criterion {0, 1}-knapsack problem are based on the core concept (i.e., based on a small number of relevant variables). But this concept is not used in problems with more than one criterion. The main purpose of this paper is to validate the existence of such a set of variables in bi-criteria {0.1}-knapsack instances. Numerical experiments were...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Applied Mathematics and Computation
دوره 219 شماره
صفحات -
تاریخ انتشار 2013